On the Curve/Point Set Matching Problem

نویسندگان

  • Paul Accisano
  • Alper Üngör
چکیده

Let P be a polygonal curve in R of length n, and S be a point set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fréchet distance between Q and P is at most a given ε. We show that this problem is NP-complete, regardless of whether or not the points of S are allowed to be visited more than once.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding a Curve in a Point Set

Let P be a polygonal curve in R of length n, and S be a point set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that its Fréchet distance from P is less than a given ε. In this paper, we consider this problem with the added freedom to transform the input curve P by translating it, rotating it, or applying an arbitrary affine transform. We pres...

متن کامل

Matching Curves to Imprecise Point Sets using Fréchet Distance

Let P be a polygonal curve in R of length n, and S be a point-set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that the Fréchet distance from P is less than a given ε. We consider eight variations of the problem based on the distance metric used and the omittability or repeatability of the points. We provide closure to a recent series of comp...

متن کامل

An Intelligent System’s Approach for Revitalization of Brown Fields using only Production Rate Data

State-of-the-art data analysis in production allows engineers to characterize reservoirs using production data. This saves companies large sums that should otherwise be spend on well testing and reservoir simulation and modeling. There are two shortcomings with today’s production data analysis: It needs bottom-hole or well-head pressure data in addition to data for rating reservoirs’ characteri...

متن کامل

Approximate Matching of Curves to Point Sets

Let P be a polygonal curve in R of length n, and S be a point set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that the Fréchet distance from P is less than a given ε. We consider eight variations of the problem based on the distance metric used and the omittability and repeatability of the points. We provide closure to a recent series of com...

متن کامل

استخراج منحنی بوریج ( بیکاری – فرصت شغلی، U-V) در ایران

One of the empirical relationships that have been used to study the dynamics of labor market is the Beveridge curve -the scatter plot of unemployment rates versus vacancy rates- that is used to summarize the state of that market. The starting point for deriving the Beveridge curve is a matching function between unemployed workers and vacant jobs. In this research, provincial data are combined ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012